New Algorithms for Predictive Scheduling with Determined Terms of Milestone Achievement

In this paper, we have proposed new algorithms for the problem of predictive production scheduling, with the Resource-Constrained Project Scheduling Problem (RCPSP). Those algorithms are adjusted for making robust the activity sequences characterised by specific unsurpassable times of completion of particular tasks related to milestones. The calculation procedures presented here provide protections against exceeding the milestone completion times, although they also make the schedule robust in the locations that are most exposed to interference. Also, the activities whose possible delays would cause the largest instability costs are better protected. The algorithm operations are comparable owing to the defined robustness measures: the predictive scheduling objective functions.